Snap Coding Interview Questions
- Expect standard medium problems with no signature question, graded on speed and code that runs
- Walk through the live HackerRank screen and the four-to-six round onsite, which commonly has two coding rounds
- Map the over-weighted patterns and the camera-team matrix tilt onto the five lessons ahead
Snap's technical phone screen runs in HackerRank's live editor over Google Meet, and the code has to compile and pass cases by the end of the hour. Candidates describe interviewers who will not accept pseudocode and who want to watch the thing run. You write in whatever language you prefer, the editor executes against tests, and there is no whiteboard.
Past that detail, the bar is a standard medium-centered DS&A loop pulled from a shared question pool. There is no in-house judge, no exotic format, and no signature algorithm unique to Snap; anything you drill for this loop also serves a Meta or Google loop. So treat it exactly that way. Prep the patterns efficiently, clear the rounds, and save the differentiated energy for system design, which is where a Snapchat loop tests something other companies cannot.
The Rounds
The usual path is a recruiter screen, then a live technical screen, then the virtual onsite. A few early-career or team-specific funnels mention an automated assessment, but there is no consistent async gate to plan around, so treat the live screen as the first real technical hurdle. Snap publishes little about its loop, so where the picture is fuzzy the round counts below flex by team and level.
- Platform: HackerRank, code runs. Live coding runs in HackerRank's live interview tool over Google Meet, in the language you choose, executing against test cases the whole session. Interviewers are described as sticklers for code that compiles and runs; a working brute force beats elegant pseudocode that does not execute. No whiteboard.
- Technical screen: One live round, ~45 to 60 min. Standard DS&A, commonly an easy warm-up such as Valid Parentheses or Two Sum paired with a medium. This is the gate that matters. Reports of a consistent online assessment are inconsistent, so prepare for the live screen as the first real filter rather than an async test.
- Onsite: 4 to 6 rounds, virtual. The common shape is two coding rounds plus a system design, a values read, then an informal lunch or Q&A chat. Algorithm-heavy teams push it toward three or four coding rounds inside a roughly six-hour day. Each technical round runs about 45 to 60 minutes and can sometimes be split across days.
- Graded on: Correct, clean, fast. Correct first, then clean structure, then optimal time and space, all of it executable. Interviewers also score the values in each round, so how you collaborate counts. This is algorithmic correctness and efficiency, not distributed scale; scale lives in the design round.
The Patterns That Come Up
The spine is the canonical FAANG medium set rather than bespoke Snap problems, with the difficulty pool reported at roughly a third easy, half medium, and the rest hard. Arrays, hashing, two-pointer and matrix work lead, anchored by the Two Sum into 3Sum chain that interviewers like to walk up. Strings and stack-parsing are heavy, with Decode String and a Premium question recurring. Dynamic programming is the one family candidates flag as a stress topic, and trees lean hard on a Premium question. Graphs and grids, linked lists, plus the stack and heap set-pieces fill out the rest. The chart shows roughly how the families split.
Difficulty is medium-centered with a real hard tail, and the tail clusters in two places. Dynamic programming is the first. Plan on at least one DP problem at the onsite. A Premium question and Best Time to Buy and Sell Stock family is the most common core, with a Premium question, Unique Paths, and a Premium question close behind. The string and stack problems are the second, where Basic Calculator and Regular Expression Matching sit at the hard end. Prep to that harder edge for whichever family hands you a round's second question.
The Snap Texture
Snap does not repaint problems in product language the way some companies do; you will not see Two Sum recast as counting streaks. What gives the loop a Snap accent is a tilt in the question mix on certain teams and a few problems that recur across the bank.
a Premium question a tree
The most consistently reported Snap tree problem. Encode a binary tree to a string and rebuild it, BFS or DFS. The follow-ups probe null handling and round-tripping, so have one clean version memorized rather than reasoning it out live.
Matrix & grid sweeps
Spiral Matrix, the max-sum k by k submatrix via 2D prefix sums, grid DP, and Word Search. Over-weighted on camera, AR, and Lens teams where image grids are the product. Know the prefix-sum and visited-set templates without thinking.
Encode & decode a string
Implement your own string encoder and decoder, sometimes with a bit-manipulation flavor. The trick is a length-prefix or delimiter scheme that survives arbitrary characters in the payload. Codec-adjacent, and a recurring set piece.
One split matters before you assume every round is backend DS&A. Front-end-leaning and iOS roles often get a role-specific coding round instead of a pure algorithm problem. Candidates for heavy front-end teams report JavaScript-and-UI tasks, such as a debounce or an event emitter, a file-explorer tree, or something like a message bubble that clears itself on a TTL. Candidates on iOS similarly report a Swift-centric round, such as debugging a broken Swift program, building a small networking client that manages concurrency with GCD, or assembling a mini-app against a live API. The pace-and-runs bar still applies, but on these tracks also drill the platform's idioms alongside the algorithm spine, because the round is scored on fluency in the tools the role actually uses. The pattern mix mapped in this guide reflects the general backend-leaning loop.
What This Section Covers
Five lessons follow, ordered by how heavily Snap leans on each family. Each opens with how the pattern shows up in a Snap round and which problems recur. Then it works the high-frequency examples, calling out the camera-team matrix flavor and the serialize-deserialize staple where they apply. Where a lesson rests on a base structure or algorithm, the full build lives in the free Foundations course, so these pages stay on what is specifically Snap.
Arrays & Hashing
The family that leads the loop. The Two Sum into 3Sum chain interviewers walk up, Move Zeroes and Kadane warm-ups, and the camera-team matrix work: Spiral Matrix and the max-sum k by k submatrix as a 2D prefix sum. Start here.
Graphs, Grids & BFS
BFS and DFS on graphs and grids. Course Schedule as topological sort, Word Search with visited tracking, and the island-style grid traversals that overlap with Snap's image-grid lean on camera and Lens teams.
Intervals & Sorting
The sort-then-sweep family. Merging and scheduling intervals, two-pointer set-pieces, and the greedy patterns like a Premium question that show up as a reported Snap favorite. Where a round wants O(n log n) and a clean sweep.
Dynamic Programming
The reported stress topic; expect at least one at the onsite. The a Premium question and Best Time to Buy and Sell Stock core, a Premium question and Climbing Stairs, grid DP like a Premium question, and the hard tail in string DP.
Trees
Anchored on a Premium question a Binary Tree, the Snap staple, with BFS and DFS both accepted. Plus a Premium question and the standard traversal and recursion work that the serialization follow-ups build on.
Common questions
What coding questions does Snap ask?
Standard medium-centered data structures and algorithms from a shared pool, with no signature Snap problem. Arrays, hashing, and matrix work lead, followed by strings and stack parsing, a near-guaranteed dynamic-programming problem, and a Premium question a binary tree as the recurring staple. Camera, AR, and Lens teams tilt toward 2D grids.
Does Snap use LeetCode or HackerRank?
Live coding runs in HackerRank's editor over Google Meet, in the language you choose, executing against test cases the whole session. The problems themselves are LeetCode-style mediums, so LeetCode is the right place to practice even though the interview tool is HackerRank.
How difficult is the Snap coding interview?
Medium-centered with a real hard tail, and candidates report the pace running quicker than at Google or Meta. The differentiator is delivering a correct, executable solution fast, then optimizing while the code keeps running, so pseudocode that does not compile loses to a plainer answer that does.
Does Snap give an online assessment?
Reports of a consistent async assessment are inconsistent, so treat the live HackerRank screen as the first real technical gate. New grads and interns see the same live screen rather than a separate test; the Snap internship and new-grad guide covers that path.
Key Takeaways
- ✓Snap coding is a standard, medium-centered FAANG DS&A bar with no signature problem. Live rounds run in HackerRank over Google Meet, your code must compile and run, and pseudocode is rejected. The live technical screen is the real first gate; a consistent async assessment is not well established.
- ✓The defining Snap signal is speed plus code that actually runs. Get a correct brute force executing fast, then optimize from there. Candidates report the bar running harder and quicker than expected even though the distribution stays medium, so practice against a clock.
- ✓The over-weighted families are arrays-hashing-matrix, strings and stack-parsing, dynamic programming, trees, graphs and grids, and linked lists. DP is the flagged stress topic with a guaranteed appearance, camera and Lens teams tilt toward 2D matrix and grid work, and serialize-deserialize a tree is the staple to memorize.
- ✓Even coding rounds carry a values read, with a why-Snap product thread running underneath. The differentiation is in system design, not here, so clear the spine reliably and move your real prep budget to the Stories, Snap Map, and ephemeral-messaging designs.
Snap interview guideKnow what Snap asks before you walk in.
19 coding · 5 system design · 15 behavioral questions
Get their questions first.
InterviewLegend is independent and not affiliated with or endorsed by any company it covers.